REPRESENTATION NUMBERS OF STARS Reza

نویسندگان

  • Reza Akhtar
  • Anthony B. Evans
  • Dan Pritikin
چکیده

A graph G has a representation modulo r if there exists an injective map f : V (G) → {0, 1, . . . , r − 1} such that vertices u and v are adjacent if and only if f(u) − f(v) is relatively prime to r. The representation number rep(G) is the smallest positive integer r for which G has a representation modulo r. In this paper we study representation numbers of the stars K1,n. We will show that the problem of determining rep(K1,n) is equivalent to determining the smallest even k for which φ(k) ≥ n: we will solve this problem for “small” n and determine the possible forms of rep(K1,n) for sufficiently large n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representation Numbers of Stars

A graph G has a representation modulo r if there exists an injective map f : V (G) → {0, 1, . . . , r−1} such that vertices u and v are adjacent if and only if f(u)−f(v) is relatively prime to r. The representation number rep(G) is the smallest positive integer r for which G has a representation modulo r. In this paper we study representation numbers of the stars K1,n. We will show that the pro...

متن کامل

Representation numbers of complete multipartite graphs

A graph G has a representation modulo r if there exists an injective map f : V (G)→ {0, 1, ..., r − 1} such that vertices u and v are adjacent if and only if f(u) − f(v) is relatively prime to r. The representation number rep(G) is the smallest r such that G has a representation modulo r. Following earlier work on stars, we study representation numbers of complete bipartite graphs and more gene...

متن کامل

Incidence dominating numbers of graphs

In this paper, the concept of incidence domination number of graphs  is introduced and the incidence dominating set and  the incidence domination number  of some particular graphs such as  paths, cycles, wheels, complete graphs and stars are studied.

متن کامل

Representations of Split Graphs , Their Complements , Stars , and Hypercubes

A graph G has a representation modulo n if there exists an injective map f : V (G) → {0, 1, . . . , n} such that vertices u and v are adjacent if and only if |f(u) − f(v)| is relatively prime to n. The representation number rep(G) is the smallest n such that G has a representation modulo n. We present new results involving representation numbers for stars, split graphs, complements of split gra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010